FRISSMiner: Mining Frequent Graph Sequence Patterns Induced by Vertices
نویسندگان
چکیده
منابع مشابه
Mining Frequent Graph Sequence Patterns Induced by Vertices
The mining of a complete set of frequent subgraphs from labeled graph data has been studied extensively. Furthermore, much attention has recently been paid to frequent pattern mining from graph sequences (dynamic graphs or evolving graphs). In this paper, we define a novel class of subgraph subsequence called an “induced subgraph subsequence” to enable efficient mining of a complete set of freq...
متن کاملMining Approximate Frequent Patterns from Graph Databases
Graph analytics is the process of discovering patterns and insights from data that can be modeled as graphs. Algorithms for graph analytics fall into two broad categories : Mining and Management. Graph mining algorithms are often used in graph management and vice versa. In recent times, these algorithms have become an indispensable tool for analyzing networks in domains such as i) Computational...
متن کاملMining of Frequent Block Preserving Outerplanar Graph Structured Patterns
An outerplanar graph is a planar graph which can be embedded in the plane in such a way that all of vertices lie on the outer boundary. Many semi-structured data like the NCI dataset having about 250,000 chemical compounds can be expressed by outerplanar graphs. In this paper, we consider a data mining problem of extracting structural features from semi-structured data like the NCI dataset. For...
متن کاملMining Weighted Frequent Patterns from Path Traversals on Weighted Graph
A lot of real world problems can be modeled as traversals on graph, and mining from such traversals has been found useful in several applications. However, previous works considered only traversals on unweighted graph. This paper generalizes this to the case where vertices of graph are given weights to reflect their importance. Under such weight settings, traditional mining algorithms can not b...
متن کاملClustering Frequent Graph Patterns
In recent years, graph mining has attracted much attention in the data mining community. Several efficient frequent subgraph mining algorithms have been recently proposed. However, the number of frequent graph patterns generated by these graph mining algorithms may be too large to be effectively explored by users, especially when the support threshold is low. In this paper, we propose to summar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Transactions on Information and Systems
سال: 2012
ISSN: 0916-8532,1745-1361
DOI: 10.1587/transinf.e95.d.1590